A Bddc Algorithm for Problems with Mortar Discretization
نویسندگان
چکیده
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elliptic problems with mortar discretizations for geometrically non-conforming partitions in both two and three spatial dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face which is an intersection of the boundaries of a pair of subdomains. A condition number bound of the form C maxi ̆
منابع مشابه
A Three-Level BDDC Algorithm for Mortar Discretizations
In this talk, three-level BDDC algorithms will be presented for the solutions of large sparse linear algebraic systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In the algorithms, the large coarse problems from two-level BDDC algorithms are solved approximately while a...
متن کاملA BDDC Algorithm for Mortar Discretization of Elasticity Problems
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elasticity problems in three dimensions with mortar discretization on geometrically nonconforming subdomain partitions. Coarse basis functions in the BDDC algorithm are constructed from primal constraints on faces. These constrains are similar to the average matching condition and the moment matching con...
متن کاملA BDDC Method for Mortar Discretizations Using a Transformation of Basis
A BDDC (balancing domain decomposition by constraints) method is developed for elliptic equations, with discontinuous coefficients, discretized by mortar finite element methods for geometrically nonconforming partitions in both two and three space dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face, which is the intersection of ...
متن کاملA Three-level Bddc Algorithm for Saddle Point Problems
BDDC algorithms have previously been extended to the saddle point problems arising from mixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generated and ...
متن کاملA three-level BDDC algorithm for a saddle point problem
Abstract BDDCalgorithms have previously been extended to the saddle point problems arising frommixed formulations of elliptic and incompressible Stokes problems. In these two-level BDDC algorithms, all iterates are required to be in a benign space, a subspace in which the preconditioned operators are positive definite. This requirement can lead to large coarse problems, which have to be generat...
متن کامل